/**
 * Created with IntelliJ IDEA.
 * Description:
 * User: 86183
 * Date: 2024-01-07
 * Time: 22:08
 */
public class MySingleList implements IList{
    static class ListNode {
        public int val;
        public ListNode next;

        public ListNode(int val) {
            this.val = val;
        }
    }
    public ListNode head;
    @Override
    public void addFirst(int data) {
        ListNode node=new ListNode(data);
        if(head==null){
            head=node;
            return;
        }
        node.next=head;
        head=node;


    }

    @Override
    public void addLast(int data) {
        ListNode node=new ListNode(data);
        if(head==null){
            head=node;
            return;
        }
        ListNode cur=head;
        while(cur.next!=null){
            cur=cur.next;
        }
        cur.next=node;

    }

    @Override
    public void addIndex(int index, int data) {
        if(index<0||index>size()){
            System.out.println("index不合法:"+index);
            return;
        }
        if(index==0){
            addFirst(data);
            return;
        }
        if (index==size()){
            addLast(data);
            return;
        }
        ListNode node = new ListNode(data);
    ListNode cur=findIndex(index);
    node.next=cur.next;
    cur.next=node;

    }
    private ListNode findIndex(int index){
        ListNode cur=head;
        while(index-1!=0){
            cur=cur.next;

        }
        return cur;
    }

    @Override
    public boolean contains(int key) {
        ListNode cur=head;

        while(cur!=null){
          if(cur.val==key){
              return true;
          }
            cur=cur.next;
        }

        return false;
    }

    @Override
    public void remove(int key) {
        if(head==null){
            return;
        }

        ListNode cur=head;
        while(cur.next!=null){
            if(cur.next.val==key){
                cur.next=cur.next.next;
                return;
            }
            cur=cur.next;
        }
        if(head.val==key){
            head=head.next;
            return;
        }


    }

    @Override
    public void removeAllKey(int key) {
        if(head==null) {
            return;
        }
        ListNode cur =head.next;
        ListNode prev=head;
        while(cur!=null){
            if(cur.val==key){
                prev.next=cur.next;
                cur=cur.next;
            }else{
                prev=cur;
                cur=cur.next;
            }
        }
        if(head.val==key){
            head=head.next;
        }
    }

    @Override
    public int size() {
        ListNode cur=head;
        int count = 0;
        while(cur!=null){
            count ++;
            cur=cur.next;
        }
        return count;


    }

    @Override
    public void display() {
        ListNode cur=head;
        while(cur!=null){
            System.out.print(cur.val+" ");
            cur=cur.next;
        }
        System.out.println();
    }

    @Override
    public void clear() {
    ListNode cur=head;
    while(cur!=null){
        ListNode curNext=cur.next;
        cur.next=null;
        cur=curNext;
    }
    head=null;

    }
}
